منابع مشابه
Breakthroughs in Radiography: Computed Radiography
CE Email comments/questions to [email protected], fax 800-556-3288, or log on to www.VetLearn.com Computed radiography (CR) is a digital imaging technology and digital x-ray image management system that has been used in human and veterinary medicine since the 1980s. CR helps eliminate many of the disadvantages of traditional radiography. A storage phosphor plate collects the pattern of x...
متن کاملDigital Radiography Versus Conventional Radiography in Dentistry
Belma Muhamedagic, Lejla Muhamedagic Faculty of Medicine, University of Sarajevo, Bosnia and Herzegovina ography-RVG, Trophy Radiologie, Croissy Beaubourg, France [now Trophy, A Kodak Company, Rochester, N.Y.]). RVG is modern diagnostic method based on use of digital roentgen. Principle is use of so called CCD chip in RVG sensor (Figure 1) that put in patient’s mouth (3). The first dental digit...
متن کاملColored Trees in Edge-Colored Graphs
The study of problems modeled by edge-colored graphs has given rise to important developments during the last few decades. For instance, the investigation of spanning trees for graphs provide important and interesting results both from a mathematical and an algorithmic point of view (see for instance [1]). From the point of view of applicability, problems arising in molecular biology are often ...
متن کاملMaximum colored trees in edge-colored graphs
Abstract We consider maximum properly edge-colored trees in edge-colored graphs Gc. We also consider the problem where, given a vertex r, determine whether the graph has a spanning tree rooted at r, such that all root-to-leaf paths are properly colored. We consider these problems from graphtheoretic as well as algorithmic viewpoints. We prove their optimization versions to be NP-hard in general...
متن کامل06 Drawing Colored Graphs on Colored Points
Let G be a planar graph with n vertices whose vertex set is partitioned into subsets V0, . . . , Vk−1 for some positive integer 1 ≤ k ≤ n and let S be a set of n distinct points in the plane partitioned into subsets S0, . . . , Sk−1 with |Vi| = |Si| (0 ≤ i ≤ k − 1). This paper studies the problem of computing a crossing-free drawing of G such that each vertex of Vi is mapped to a distinct point...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: American Journal of Roentgenology
سال: 1966
ISSN: 0361-803X,1546-3141
DOI: 10.2214/ajr.98.4.966